An incremental approach to attribute reduction from dynamic incomplete decision systems in rough set theory

Article history: Received 3 August 2013 Received in revised form 15 May 2015 Accepted 22 June 2015 Available online 2 July 2015 Attribute reduction is an important preprocessing step in datamining and knowledge discovery. The effective computation of an attribute reduct has a direct bearing on the efficiency of knowledge acquisition and various related tasks. In real-world applications, some attribute values for an object may be incomplete and an object set may vary dynamically in the knowledge representation systems, also called decision systems in rough set theory. There are relatively few studies on attribute reduction in such systems. This papermainly focuses on this issue. For the immigration and emigration of a single object in the incomplete decision system, an incremental attribute reduction algorithm is developed to compute a new attribute reduct, rather than to obtain the dynamic system as a newone that has to be computed from scratch. In particular, for the immigration and emigration ofmultiple objects in the system, another incremental reduction algorithmguarantees that a newattribute reduct can be computed on the fly, which avoids some re-computations. Compared with other attribute reduction algorithms, the proposed algorithms can effectively reduce the time required for reduct computationswithout losing the classification performance. Experiments on different real-life data sets are conducted to test and demonstrate the efficiency and effectiveness of the proposed algorithms. © 2015 Elsevier B.V. All rights reserved.